Comunidades y robustez en redes complejas reales y sintéticas

Tesis (Doctor en Física)--Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía, Física y Computación, 2022.El estudio de las redes complejas, sistemas cuya estructura está regida por una compleja red de interacciones, es un área activa de investigación multidisciplinaria. Este campo ha recibido un gran impulso en los últimos años debido a la disponibilidad de una cantidad masiva de datos y a la existencia de recursos computacionales que permiten llevar a cabo los análisis estadísticos requeridos. Redes complejas extensas pueden encontrarse en una gran cantidad de sistemas naturales y artificiales, tales como sistemas físicos, biológicos, sociales, infraestructuras tecnológicas, etc. El aporte de la física a esta temática viene de la mano de la mecánica estadística, cuyas herramientas han facilitado el estudio de la estructura, la dinámica y la evolución de las redes complejas, brindando un marco teórico adecuado para el estudio cualitativo y cuantitativo de estos sistemas. La caracterización estadística de la estructura de las redes complejas se aborda desde diversos enfoques. Entre ellos hay dos que se destacan por la información que aportan y por las implicancias prácticas que ofrecen. Por una parte, la caracterización de estructuras modulares o comunidades es importante para entender la funcionalidad de las redes. Por otra parte, el estudio de la resiliencia de las redes ante fallas o ataques dirigidos es de gran utilidad para comprender cómo pueden generarse redes con un funcionamiento robusto. Curiosamente, estos dos conceptos –la existencia de comunidades y robustez de las redes– están íntimamente relacionados, y su estudio presenta grandes desafíos, dada la complejidad de los cálculos y análisis necesarios para su abordaje. En esta tesis estudiamos la existencia de comunidades en redes de jugadores de ajedrez utilizando la base de datos de partidas más extensa disponible, en su momento, en el mundo. Realizamos una caracterización general de las mismas y observamos una fuerte correlación entre las comunidades y el nivel de juego de los jugadores. En lo que respecta a las fallas y/o ataques analizamos redes sintéticas, tales como grafos de Erdös-Rényi y redes planares de Delaunay. Caracterizamos la robustez de las mismas mediante el estudio de transiciones de percolación, utilizando las herramientas de análisis de los fenómenos críticos y extensas simulaciones numéricas. Observamos que las transiciones varían de manera cualitativa de acuerdo con el tipo de red y con la estrategia de ataque empleada. En particular, observamos que algunos ataques generan transiciones similares a las encontradas en procesos de percolación explosiva.The study of complex networks, systems whose structure is governed by a complex interaction network, is an active multidisciplinary field of research in which physics has had a prevailing role. This field has received great impulse during the last years because of the availability of a massive amount of data and the existence of computational resources that allow to perform the required statistical analysis. Extensive complex networks can be found in a large variety of natural and artificial systems, such as physical, biological, and social systems, technological infrastructures, etc. Given the importance of these systems, investigations exploring the structure, dynamics and evolution of complex networks has raised the interest of the physics community, as tools coming from statistical mechanics, as well as from other fields of physics, are fundamental and have a direct application in the analysis and comprehension of such systems. The statistical characterization of the structure of complex networks is addressed from different approaches. Among them there are two that stand because of the information they give and because of the practical applications they allow. On one side, the characterization of modular structures or communities is important to understand the functionality of networks. On the other side, the study of the resiliency of networks against failures or targeted attacks gives relevant information on how to develop robust networks. Interestingly, these two concepts --the existence of communities and the robustness of networks-- are closely related, and their study presents big challenges, given the complexity of the calculations and analysis required to address them. In this thesis we studied the existence of communities in networks of chess players using the largest available database, at the moment, on the world. We performed a general characterization of the networks, observing a strong correlation between communities and player skill level. In terms of failures and targeted attacks, we studied synthetic random networks, such as Erdös-Rényi graphs and Delaunay triangulations. We characterized their robustness through the study of percolation transitions, using tools from critical phenomena and extensive numerical simulations. We observed that the transitions vary in a qualitative manner depending on the type of network and the attack strategy. In particular, we found that certain attacks generate transitions similar to those encountered in processes of explosive percolation.Fil: Almeira, Nahuel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía, Física y Computación; Argentina

Outlier Mining Methods Based on Graph Structure Analysis

Outlier detection in high-dimensional datasets is a fundamental and challenging problem across disciplines that has also practical implications, as removing outliers from the training set improves the performance of machine learning algorithms. While many outlier mining algorithms have been proposed in the literature, they tend to be valid or efficient for specific types of datasets (time series, images, videos, etc.). Here we propose two methods that can be applied to generic datasets, as long as there is a meaningful measure of distance between pairs of elements of the dataset. Both methods start by defining a graph, where the nodes are the elements of the dataset, and the links have associated weights that are the distances between the nodes. Then, the first method assigns an outlier score based on the percolation (i.e., the fragmentation) of the graph. The second method uses the popular IsoMap non-linear dimensionality reduction algorithm, and assigns an outlier score by comparing the geodesic distances with the distances in the reduced space. We test these algorithms on real and synthetic datasets and show that they either outperform, or perform on par with other popular outlier detection methods. A main advantage of the percolation method is that is parameter free and therefore, it does not require any training; on the other hand, the IsoMap method has two integer number parameters, and when they are appropriately selected, the method performs similar to or better than all the other methods tested.Peer ReviewedPostprint (published version

Short-ranged memory model with preferential growth

In this work we introduce a variant of the Yule-Simon model for preferential growth by incorporating a finite kernel to model the effects of bounded memory. We characterize the properties of the model combining analytical arguments with extensive numerical simulations. In particular, we analyze the lifetime and popularity distributions by mapping the model dynamics to corresponding Markov chains and branching processes, respectively. These distributions follow power laws with well-defined exponents that are within the range of the empirical data reported in ecologies. Interestingly, by varying the innovation rate, this simple out-of-equilibrium model exhibits many of the characteristics of a continuous phase transition and, around the critical point, it generates time series with power-law popularity, lifetime and interevent time distributions, and nontrivial temporal correlations, such as a bursty dynamics in analogy with the activity of solar flares. Our results suggest that an appropriate balance between innovation and oblivion rates could provide an explanatory framework for many of the properties commonly observed in many complex systems.Fil: Schaigorodsky, Ana Laura. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; ArgentinaFil: Perotti, Juan Ignacio. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; ArgentinaFil: Almeira, Nahuel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; ArgentinaFil: Billoni, Orlando Vito. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentin

Role of transcriptional bursts in cellular oscillations

Genetic oscillators are present in the cells of many organisms and control several biological processes. The common feature of such oscillators is the presence of a protein which represses the transcription of its own gene. Recently, it has been shown that for many genes transcription is not a continuous process, but that it proceeds in bursts. We study here the relationship between bursty transcription and the robustness of protein oscillations. We concentrate on the temporal profile of mRNA production by studying regimes where this profile changes but the amount of mRNA produced is kept fixed. For systems with different degrees of cooperativity we show that in general bursts are associated with more robust oscillations, but when they are too short and intense they can have the opposite effect. In other words, we show that, in terms of the regularity of the oscillations generated, there is an optimal value for the intensity of the bursts.Fil: Almeira, Nahuel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; ArgentinaFil: Risau Gusman, Sebastian Luis. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Patagonia Norte; Argentina. Comisión Nacional de Energía Atómica. Gerencia del Area de Investigación y Aplicaciones No Nucleares. Gerencia de Física (Centro Atómico Bariloche); Argentin

Towards a generalization of information theory for hierarchical partitions

Complex systems often exhibit multiple levels of organization covering a wide range of physical scales, so the study of the hierarchical decomposition of their structure and function is frequently convenient. To better understand this phenomenon, we introduce a generalization of information theory that works with hierarchical partitions. We begin revisiting the recently introduced hierarchical mutual information (HMI), and show that it can be written as a level by level summation of classical conditional mutual information terms. Then, we prove that the HMI is bounded from above by the corresponding hierarchical joint entropy. In this way, in analogy to the classical case, we derive hierarchical generalizations of many other classical information-theoretic quantities. In particular, we prove that, as opposed to its classical counterpart, the hierarchical generalization of the variation of information is not a metric distance, but it admits a transformation into one. Moreover, focusing on potential applications of the existing developments of the theory, we show how to adjust by chance the HMI. We also corroborate and analyze all the presented theoretical results with exhaustive numerical computations, and include an illustrative application example of the introduced formalism. Finally, we mention some open problems that should be eventually addressed for the proposed generalization of information theory to reach maturity.Fil: Perotti, Juan Ignacio. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; ArgentinaFil: Almeira, Nahuel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; ArgentinaFil: Saracco, Fabio. IMT School for Advanced Studies Lucca; Itali

Scaling of percolation transitions on Erdös-Rényi networks under centrality-based attacks

The study of network robustness focuses on the way the overall functionality of a network is affected as some of its constituent parts fail. Failures can occur at random or be part of an intentional attack and, in general, networks behave differently against different removal strategies. Although much effort has been put on this topic, there is no unified framework to study the problem. While random failures have been mostly studied under percolation theory, targeted attacks have been recently restated in terms of network dismantling. In this work, we link these two approaches by performing a finite-size scaling analysis to four dismantling strategies over Erdös-Rényi networks: initial and recalculated high degree removal and initial and recalculated high betweenness removal. We find that the critical exponents associated with the initial attacks are consistent with the ones corresponding to random percolation. For recalculated high degree, the exponents seem to deviate from mean field, but the evidence is not conclusive. Finally, recalculated betweenness produces a very abrupt transition with a hump in the cluster size distribution near the critical point, resembling some explosive percolation processes.Fil: Almeira, Nahuel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; ArgentinaFil: Billoni, Orlando Vito. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; ArgentinaFil: Perotti, Juan Ignacio. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; Argentin

Outlier Mining Methods Based on Graph Structure Analysis

Outlier detection in high-dimensional datasets is a fundamental and challenging problem across disciplines that has also practical implications, as removing outliers from the training set improves the performance of machine learning algorithms. While many outlier mining algorithms have been proposed in the literature, they tend to be valid or efficient for specific types of datasets (time series, images, videos, etc.). Here we propose two methods that can be applied to generic datasets, as long as there is a meaningful measure of distance between pairs of elements of the dataset. Both methods start by defining a graph, where the nodes are the elements of the dataset, and the links have associated weights that are the distances between the nodes. Then, the first method assigns an outlier score based on the percolation (i.e., the fragmentation) of the graph. The second method uses the popular IsoMap non-linear dimensionality reduction algorithm, and assigns an outlier score by comparing the geodesic distances with the distances in the reduced space. We test these algorithms on real and synthetic datasets and show that they either outperform, or perform on par with other popular outlier detection methods. A main advantage of the percolation method is that is parameter free and therefore, it does not require any training; on the other hand, the IsoMap method has two integer number parameters, and when they are appropriately selected, the method performs similar to or better than all the other methods tested.Peer Reviewe

Stochastic model for football's collective dynamics

In this paper, we study collective interaction dynamics emerging in the game of football (soccer). To do so, we surveyed a database containing body-sensor traces measured during three professional football matches, where we observed statistical patterns that we used to propose a stochastic model for the players' motion in the field. The model, which is based on linear interactions, captures to a good approximation the spatiotemporal dynamics of a football team. Our theoretical framework, therefore, can be an effective analytical tool to uncover the underlying cooperative mechanisms behind the complexity of football plays. Moreover, we showed that it can provide handy theoretical support for coaches to evaluate teams' and players' performances in both training sessions and competitive scenarios.Fil: Chacoma, Andrés Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; ArgentinaFil: Almeira, Nahuel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; ArgentinaFil: Perotti, Juan Ignacio. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; ArgentinaFil: Billoni, Orlando Vito. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; Argentin

Modeling ball possession dynamics in the game of football

In this paper, we study interaction dynamics in the game of football-soccer in the context of ball possession intervals. To do so, we analyze a database comprising one season of the five major football leagues of Europe. Using this input, we developed a stochastic model based on three agents: two teammates and one defender. Despite its simplicity, the model is able to capture, in good approximation, the statistical behavior of possession times, pass lengths, and number of passes performed. In the last section, we show that the model's dynamics can be mapped into a Wiener process with drift and an absorbing barrier.Fil: Chacoma, Andrés Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; ArgentinaFil: Almeira, Nahuel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; ArgentinaFil: Perotti, Juan Ignacio. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; ArgentinaFil: Billoni, Orlando Vito. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Física Enrique Gaviola. Universidad Nacional de Córdoba. Instituto de Física Enrique Gaviola; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física; Argentin

Structure constrained by metadata in networks of chess players

Abstract Chess is an emblematic sport that stands out because of its age, popularity and complexity. It has served to study human behavior from the perspective of a wide number of disciplines, from cognitive skills such as memory and learning, to aspects like innovation and decision-making. Given that an extensive documentation of chess games played throughout history is available, it is possible to perform detailed and statistically significant studies about this sport. Here we use one of the most extensive chess databases in the world to construct two networks of chess players. One of the networks includes games that were played over-the-board and the other contains games played on the Internet. We study the main topological characteristics of the networks, such as degree distribution and correlations, transitivity and community structure. We complement the structural analysis by incorporating players’ level of play as node metadata. Although both networks are topologically different, we show that in both cases players gather in communities according to their expertise and that an emergent rich-club structure, composed by the top-rated players, is also present